Interpretation and Instantiation of Theories for Reasoning about Formal Speciications Interpretation and Instantiation of Theories for Reasoning about Formal Speciications

نویسندگان

  • Nicholas Hamilton
  • Ray Nickson
  • Owen Traynor
  • Mark Utting
چکیده

In this paper an outline is given of an approach to formally reasoning about importation , parameterisation and instantiation of speciications written in a modular extension of the Z language (called Sum). Interpretation and instantiation of theories in rst order logic are well understood. We illustrate how to use these results directly to provide a framework within which we can soundly and eeciently reason about modular speciications. A reasoning environment within the Ergo 4:1 theorem prover has been constructed that provides the theory management, construction and extension facilities needed to support such a reasoning process. Sum speciications are mapped to the appropriate Ergo structures by a straightforward translation process. A simple example in Sum is presented to demonstrate the use of these theory extension mechanisms. As far as the authors are aware, no other system ooers interpreted automated support for reasoning about parameterisation and instantiation of modular model-oriented speciications.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Reasonong about Classess in Object-Oriented Languages: Logical Models and Tools

A formal language ccsl is introduced for describing specii-cations of classes in object-oriented languages. We show how class speci-cations in ccsl can be translated into higher order logic. This allows us to reason about these speciications. In particular, it allows us (1) to describe (various) implementations of a particular class speciication, (2) to develop the logical theory of a speciic c...

متن کامل

Logical Foundations for Declarative Object-oriented Programming Logical Foundations for Declarative Object-oriented Programming ?

We present a formalism for reasoning about declarative object-oriented programs. Classes are represented as rst-order theories that contain logic programs as methods. Inheritance, genericity and related concepts are represented by operations on such theories which preserve the consistency of these theories as well as the correctness of the programs speciied by their axioms. Our approach provide...

متن کامل

Correctness of the Logical System for Structured Speciications

The main aim of this paper is to present the completeness proof of a formal system for reasoning about logical consequences of structured speciications. The system is based on the proof rules for structural speciications build in an arbitrary institution as presented in ST 88]. The proof of its completeness is inspired by the proof due to M. V. Cengarle (see Cen 94]) for speciications in rst-or...

متن کامل

Moving speci cation structures between logicalsystems ?

The conditions under which a formal system for reasoning about structural speciications, built over one logical system could be reused for reasoning about structured speciications built over another logical system are formulated and studied. Following Goguen and Burstall, the notion of a logical system is formalized as an institution and extended to a D-institution. A new function between class...

متن کامل

A Tool to Support Formal Reasoning about Computer Languages

A tool to support formal reasoning about computer languages and spe-ciic language texts is described. The intention is to provide a tool that can build a formal reasoning system in a mechanical theorem prover from two speciications, one for the syntax of the language and one for the semantics. A parser, pretty-printer and internal representations are generated from the former. Logical represent...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1997